Polynomial-based Filters in Bandpass Interpolation and Sampling Rate Conversion
نویسنده
چکیده
If the SRC is performed between arbitrary sampling rates, then the SRC factor can be a ratio of two very large integers or even an irrational number. An efficient way to reduce the implementation complexity of a SRC system in those cases is to use polynomial-based interpolation filters with the impulse response ha(t) having the following properties. ha(t) is nonzero for an interval 0 ≤ t < NT with N being an even integer and is expressible in each subinterval of length T by means of a polynomial of a low order. The length of polynomial segments T can be equal to the input or output sampling interval, a fraction of the input or output sampling interval, or an integer multiple of the input or output sampling interval. The advantage of mimicking the above system lies in the fact the actual implementations can be performed effectively by using the Farrow structure or its modifications. So far, the polynomial-based filters have been used only for baseband interpolation and SRC. In the literature, it has been observed that in the passband applications the filter order of the polynomial-based filter increases. In this paper, we study application of the polynomial-based filters for the bandpass interpolation and SRC. It is shown that the polynomial-based filters, implemented using Farrow structure or its modification, can be effectively used also in the bandpass applications. We show through examples that the filter order is the same as for the corresponding baseband filter having same requirements.
منابع مشابه
Estimation of the Length and the Polynomial Order of Polynomial-based Filters
In many signal processing applications it is beneficial to use polynomial-based interpolation filters for sampling rate conversion. Actual implementations of these filters can be performed effectively by using the Farrow structure or its modifications. In the literature, several design methods have been proposed. However, estimation formulae for the number of polynomialsegments defining the fin...
متن کاملCascades of Polynomial-based and Fir Filters for Sampling Rate Conversion
where Fin = 1/Tin (Tin) and Fout = 1/Tout (Tout) are the original input sampling rate (period) and the sampling rate (period) after the conversion, respectively. The sampling rate conversion can be divided into two general cases. For R < 1, the original sampling rate is reduced and this process is known as decimation. For R > 1, the original sampling rate is increased and this process is known ...
متن کاملLow complexity multi-rate IF sampling receivers using CIC filters and polynomial interpolation
This contribution deals with a fully digital multirate radio receiver with IF sampling. Timing correction and sample rate conversion are performed by a polynomial interpolator. By performing interpolation prior to matched filtering a significant reduction in complexity may be achieved. Low degradations are attainable when the receiver design parameters are carefully chosen. If this is not possi...
متن کاملExtended Algorithms for Sample Rate Conversion
The idea of software radio (SWR) implies the capability of changing the air-interface just by down-loading the respective software. Since analog components (e.g., for prefiltering and digitization) are difficult to parameterize these tasks have to be moved to the digital domain, or have to be done in a standard independent way. In such receivers the task of sample rate conversion (SRC) is essen...
متن کاملAn Efficient Asynchronous Sampling-rate Conversion Algorithm for Multi-channel Audio Applications
We describe an asynchronous sampling-rate conversion (SRC) algorithm that is specifically tailored to multichannel audio applications. The algorithm is capable of converting between arbitrary asynchronous sampling-rates around a fixed operating point, and is designed to operate in multi-threaded systems. The algorithm uses a set of fractional delay filters together with cubic interpolation to a...
متن کامل